منابع مشابه
Maximal (sequentially) compact topologies
We revisit the known problem whether each compact topology is contained in a maximal compact topology and collect some partial answers to this question. For instance we show that each compact topology is contained in a compact topology in which convergent sequences have unique limits. We also answer a question of D.E. Cameron by showing that each sequentially compact topology is contained in a ...
متن کاملOn Generalized Injective Spaces in Generalized Topologies
In this paper, we first present a new type of the concept of open sets by expressing some properties of arbitrary mappings on a power set. With the generalization of the closure spaces in categorical topology, we introduce the generalized topological spaces and the concept of generalized continuity and become familiar with weak and strong structures for generalized topological spaces. Then, int...
متن کاملStable Banach Spaces and Banach Space Structures, Ii: Forking and Compact Topologies
We study model theoretical stability for structures from functional analysis. We prove a functional-analytic version of the Finite Equivalence Relation Theorem. We also the Stability Spectrum Theorem for Banach space structures.
متن کاملWeaker connected and weaker nowhere locally compact topologies for metrizable and similar spaces
We prove that any metrizable non-compact space has a weaker metrizable nowhere locally compact topology. As a consequence, any metrizable non-compact space has a weaker Hausdorff connected topology. The same is established for any Hausdorff space X with a σ -locally finite base whose weight w(X) is a successor cardinal. 2002 Elsevier Science B.V. All rights reserved. AMS classification: Prima...
متن کاملCombinatorial Spaces And Order Topologies
An archetypal problem discussed in computer science is the problem of searching for a given number in a given set of numbers. Other than sequential search, the classic solution is to sort the list of numbers and then apply binary search. The binary search problem has a complexity of O(logN) for a list of N numbers while the sorting problem cannot be better than O(N) on any sequential computer f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Filomat
سال: 2019
ISSN: 0354-5180,2406-0933
DOI: 10.2298/fil1907061k